#include<iostream>
#include<cstring>
using namespace std;
const int N = 23, INF = 0x3f3f3f3f;
int h[N];
void init()
{
	memset(h,0x3f,sizeof h);
}
int f(int x)
{
	int id = (x % N + N) % N;
	while (h[id] != INF && h[id] != x)
	{
		id++;
		if (id == N) id = 0;
	}
	return id;
}
bool find(int x)
{
	int p = f(x);
	return h[p] == x;
}
int main()
{
	init();

	return 0;
}